A Fast Near Optimal Vertex Cover Algorithm (NOVCA)
نویسنده
چکیده
This paper describes an extremely fast polynomial time algorithm, the Near Optimal Vertex Cover Algorithm (NOVCA) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of (i) including the vertex having maximum degree in the vertex cover and (ii) rendering the degree of a vertex to zero by including all its adjacent vertices. The two versions of algorithm, NOVCA-I and NOVCA-II, have been developed. The results identifying bounds on the size of the minimum vertex cover as well as polynomial complexity of algorithm are given with experimental verification. Future research efforts will be directed at tuning the algorithm and providing proof for better approximation ratio with NOVCA compared to any other available vertex cover algorithms.
منابع مشابه
A Heuristic Approach to Fast NOVCA (Near Optimal Vertex Cover Algorithm)
This paper describes an extremely fast polynomial time algorithm, the NOVCA (Near Optimal Vertex Cover Algorithm) that produces an optimal or near optimal vertex cover for any known undirected graph G (V, E). NOVCA is based on the idea of (1) including the vertex having maximum degree in the vertex cover and (2) rendering the degree of a vertex to zero by including all its adjacent vertices. Th...
متن کاملA Near Optimal Approximation Algorithm for Vertex-Cover Problem
Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a polynomial time efficient algorithm for vertex-cover problem for more approximate to the optimal solution, which lead to the worst time complexity Θ(V ) and space c...
متن کاملA Hybrid Genetic Algorithm for Minimum Vertex Cover Problem
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. In this paper we have demonstrated that when local optimization technique is added to genetic algorithm to form HGA, it gives near to optimal solution speedy. We have developed new heuristic vertex crossover operator ...
متن کاملThesis for the degree Master of Science
We study the well known vertex cover problem in various data streaming settings. Our first result considers a special family of graphs, the Vertex-Disjoint Paths (V DP ) family. We say that a graph G is in the V DP family if the edges of G are a union of vertex disjoint paths. For a V DP graph with n vertices given in a dynamic stream, in which both insertions and deletions are allowed, we prov...
متن کاملExploiting Reduction Rules and Data Structures: Local Search for Minimum Vertex Cover in Massive Graphs
The Minimum Vertex Cover (MinVC) problem is a well-known NP-hard problem. Recently there has been great interest in solving this problem on real-world massive graphs. For such graphs, local search is a promising approach to finding optimal or near-optimal solutions. In this paper we propose a local search algorithm that exploits reduction rules and data structures to solve the MinVC problem in ...
متن کامل